#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=120;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
       LL n,k;cin>>n>>k;
       memset(a,0,sizeof(a));
       LL maxv=(n-1)/2;
       if(maxv<k){
          cout<<"-1"<<"\n";
       }
       else{
          LL tot=n;
          multiset<LL>s;
          for(LL i=1;i<=n;i++) s.insert(i);
          for(LL i=2;i<=n;i+=2){
             if(k){
                a[i]=tot;
                s.erase(tot);
                tot--;
                k--;
             }
          }
          for(LL i=1;i<=n;i++){
              if(!a[i]){
                 a[i]=(*s.begin());
                 s.erase(*s.begin());
              }
          }
          for(LL i=1;i<=n;i++){
             cout<<a[i]<<" ";
          }
          cout<<"\n";
       }
   }
   return 0;
}
